Which Problems Have Strongly Exponential Complexity?
نویسندگان
چکیده
منابع مشابه
Which Problems Have Strongly Exponential Complexity?
For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper, we address the relative likelihood of sub-exponential algorithms for these problems. We introduce a generalized reduction which we call Sub-Exponential Reduction Family (SERF) that preserves sub-exponential complexity. We show that CircuitSAT is SERF-complete for all NP-sea...
متن کاملInverse Problems Have Inverse Complexity
In this paper we show that inverting problems of higher complexity is easier than inverting problems of lower complexity. While inverting Σ i 3CNFSAT is known to be coNP-complete [6] for i = 1 we prove that it remains coNP-complete for i = 2 and is in P for all i ≥ 3. Relatedly, we show that inverting Σ i 3DNFSAT is in P for all i ≥ 1.
متن کاملThe exponential complexity of satisfiability problems
of the Dissertation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi Chapter
متن کاملParameterized Complexity: Exponential Speed-Up for Planar Graph Problems
We discuss general techniques, centered around the “Layerwise Separation Property” (LSP) of a planar graph problem, that allow to develop algorithms with running time c √ k|G|, given an instance G of a problem on planar graphs with parameter k. Problems having LSP include planar vertex cover, planar independent set, and planar dominating set. Extensions of our speed-up technique to basically al...
متن کاملOn Ideals Which Have the Weakly Insertion of Factors Property
A one-sided ideal of a ring has the insertion of factors property (or simply, IFP) if implies r for . We say a one-sided ideal of has the weakly IFP if for each , implies , for some non-negative integer . We give some examples of ideals which have the weakly IFP but have not the IFP. Connections between ideals of which have the IFP and related ideals of some ring extensions a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2001
ISSN: 0022-0000
DOI: 10.1006/jcss.2001.1774